Finding Novel Information in Large, Constantly Incrementing Collections of Structured Data
نویسندگان
چکیده
Project Argus addresses the problem of obtaining novel intelligence from large, constantly incrementing collections of structured data like shipping records, financial transfers, or hospital admission records. Structured data already provides intelligence analysts with a huge amount of important information. The ever-increasing capabilities of techniques to discern structure in currently unstructured data like text, image and voice ensure that handling structured data will only become more important for intelligence analysis.
منابع مشابه
Exploring Large Digital Library Collections Using a Map-Based Visualisation
In this paper we describe a novel approach for exploring large document collections using a map-based visualisation. We use hierarchically structured semantic concepts that are attached to the documents to create a visualisation of the semantic space that resembles a Google Map. The approach is novel in that we exploit the hierarchical structure to enable the approach to scale to large document...
متن کاملMining Research Communities in Bibliographical Data
Extracting information from very large collections of structured, semistructured or even unstructured data can be a considerable challenge when much of the hidden information is implicit within relationships among entities in the data. Social networks are such data collections in which relationships play a vital role in the knowledge these networks can convey. A bibliographic database is an ess...
متن کاملQUICK: Expressive and Flexible Search over Knowledge Bases and Text Collections
Recent work on Web-extracted data sets has produced an interesting new source of structured Web data. These data sets can be viewed as knowledge bases (KB) – large heterogeneous linked entity collections with millions of unique edge and node labels, often encoding rich semantic information over entities. For example, YAGO [5] and ExDB [2] have fact collections numbering in the tens and hundreds...
متن کاملAn Effective Path-aware Approach for Keyword Search over Data Graphs
Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...
متن کاملBowlognaBench - Benchmarking RDF Analytics
The proliferation of semantic data on the Web requires RDF database systems to constantly improve their scalability and efficiency. At the same time, users are increasingly interested in investigating large collections of online data by performing complex analytic queries (e.g.,“how did university student performance evolve over the last 5 years?”). This paper introduces a novel benchmark for e...
متن کامل